Parallel Homotopy Algorithms to Solve Polynomial Systems
نویسندگان
چکیده
Homotopy continuation methods to compute numerical approximations to all isolated solutions of a polynomial system are known as “embarrassingly parallel”, i.e.: because of their low communication overhead, these methods scale very well for a large number of processors. Because so many important problems remain unsolved mainly due to their intrinsic computational complexity, it would be embarrassing not to develop parallel implementations of polynomial homotopy continuation methods. The focus of this talk is the development of “parallel PHCpack”, a project which started a couple of years ago in collaboration with Yusong Wang, and which currently continues with Anton Leykin (parallel irreducible decomposition) and Yan Zhuang (parallel polyhedral homotopies). We report on our efforts to make PHCpack ready to solve large polynomial systems which arise in applications. 2000 Mathematics Subject Classification. Primary 65H10. Secondary 14Q99, 68W30.
منابع مشابه
Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize...
متن کاملHOM4PS-2.0para: Parallelization of HOM4PS-2.0 for solving polynomial systems
HOM4PS-2.0 is a software package in FORTRAN 90 which implements the polyhedral homotopy continuation method for solving polynomial systems. It leads in speed over the existing software packages in the same category by huge margins. This article details the description of the parallel version of HOM4PS2.0, named HOM4PS-2.0para. Excellent scalability in the numerical results shows that the parall...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملDirect GBQ Algorithm for Solving Mixed Trigonometric Polynomial Systems
In many fields of science and engineering, it is needed to find all solutions of mixed trigonometric polynomial systems. Commonly, mixed trigonometric polynomial systems are transformed into polynomial systems by variable substitution and adding some quadratic equations, and then solved by some numerical methods. However, transformation of a mixed trigonometric polynomial system into a polynomi...
متن کامل